Sensitivity analysis for bottleneck assignment problems
نویسندگان
چکیده
In assignment problems, decision makers are often interested in not only the optimal assignment, but also sensitivity of to perturbations weights. Typically, individual weights considered. We present a novel extension traditional analysis by allowing for simultaneous variations all Focusing on bottleneck problem, we provide two different methods quantifying and algorithms each. Numerical examples as well discussion complexity provided.
منابع مشابه
On The Bottleneck and Capacity Assignment Problems
The bottleneck (capacity) assignment problem seeks for a set of entries in a matrix A, one for each column and row, that minimizes (maximizes) the largest (smallest) element over all such sets. Our interest lies in finding the asymptotically exact solution to these problems in a probabilistic framework, that is, under the asswnption that elements in the matrix are independent random variables w...
متن کاملAn algorithm for integrated worker assignment, mixed-model two-sided assembly line balancing and bottleneck analysis
This paper addresses a multi-objective mixed-model two-sided assembly line balancing and worker assignment with bottleneck analysis when the task times are dependent on the worker’s skill. This problem is known as NP-hard class, thus, a hybrid cyclic-hierarchical algorithm is presented for solving it. The algorithm is based on Particle Swarm Optimization (PSO) and Theory of Constraints (TOC) an...
متن کاملAn Algorithm for Solving Intuitionistic Fuzzy Linear Bottleneck Assignment Problems
The linear bottleneck assignment problem (LBAP), which is a variation of the classical assignment problem, seeks to minimize the longest completion time rather than the sum of the completion times when a number of jobs are to be assigned to the same number of workers. If the completion times are not certain, then it is said to be a fuzzy LBAP. Here we propose a new algorithm to solve fuzzy LBAP...
متن کاملThe approximability of three-dimensional assignment problems with bottleneck objective
We discuss two special cases of the three-dimensional bottleneck assignment problemwhere a certain underlying cost function satisfies the triangle inequality. We present polynomial time 2-approximation algorithms for the broadest class of these special cases, and we prove that (unless P = NP) this factor 2 is best possible even in the highly restricted setting of the Euclidean plane.
متن کاملA New Approach for Solving Grey Assignment Problems
Linear assignment problem is one of the most important practical models in the literature of linear programming problems. Input data in the cost matrix of the linear assignment problem are not always crisp and sometimes in the practical situations is formulated by the grey systems theory approach. In this way, some researchers have used a whitening technique to solve the grey assignment p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: European Journal of Operational Research
سال: 2022
ISSN: ['1872-6860', '0377-2217']
DOI: https://doi.org/10.1016/j.ejor.2022.02.037